Oblivious algebraic data types

Secure computation allows multiple parties to compute joint functions over private data without leaking any sensitive data, typically using powerful cryptographic techniques. Writing secure applications these techniques directly can be challenging, resulting in the development of several programming languages and compilers that aim make accessible. Unfortunately, many either lack or have limited support for rich recursive structures, like trees. In this paper, we propose a novel representation structured types, which call oblivious algebraic language writing computations them. This combines dependent types with constructs computation, provides security-type system ensures adversaries learn nothing more than result computation. Using language, authors write single function then easily build an equivalent according desired public view their data.